Word Ordering as a Graph Rewriting Process
نویسندگان
چکیده
This paper shows how the correspondence between a unordered dependency tree and a sentence that expresses it can be achieved by transforming the tree into a string where each linear precedence link corresponds to one specific syntactic relation. We propose a formal grammar with a distributed architecture that can be used for both synthesis and analysis. We argue for the introduction of a topological tree as an intermediate step between dependency syntax and word order.
منابع مشابه
Applications of Cayley Graphs
This paper demonstrates the power of the Cayley graph approach to solve specific applications , such as rearrangement problems and the design of interconnection networks for parallel CPU's. Recent results of the authors for efficient use of Cayley graphs are used here in exploratory analysis to extend recent results of Babai et al. on a family of trivalent Cayley graphs associated with P SL 2 (...
متن کاملTermination Proofs Using gpo Ordering Constraints
We present here an algorithm for proving termination of term rewriting systems by gpo ordering constraint solving. The algorithm gives, as automatically as possible, an appropriate instance of the gpo generic ordering proving termination of a given system. Constraint solving is done eeciently thanks to a DAG shared term data structure.
متن کاملWell-founded Path Orderings for Operads
The definition herein of the Graph Path Ordering (GPO) on certain graph expressions is inspired by that of the Recursive Path Ordering (RPO), and enjoys all those properties that have made RPO popular, in particular, well-foundedness and monotonicity on variable-free terms. We are indeed interested in a generalization of algebraic expressions called operadic expressions, which are finite graphs...
متن کاملThe theory of total unary rpo is
The Recursive Path Ordering (rpo) is a syntactic ordering on terms that has been widely used for proving termination of term-rewriting systems 7,20]. How to combine term-rewriting with ordered resolution and paramodulation is now well-understood and it has been successfully applied in many theorem-proving systems 11,16,21]. In this setting an ordering such as rpo is used both to orient rewrite ...
متن کاملContents A Simple Graph Grammar Enabling the Representation of Layered
concurrent semantics are also defined. Three classical observations for concurrent semantics — interleaving, partial ordering and mixed ordering — are defined on the graph derivations. Bisimulation is exploited to obtain three equivalences of π-calculus agents corresponding to the observations. As expected, the ordinary observational equivalence for the π-calculus is re-obtained in this context...
متن کامل